Constructing genus 3 hyperelliptic Jacobians with CM
نویسندگان
چکیده
Given a sextic CM field K, we give an explicit method for finding all genus 3 hyperelliptic curves defined over C whose Jacobians are simple and have complex multiplication by the maximal order of this field, via an approximation of their Rosenhain invariants. Building on the work of Weng [27], we give an algorithm which works in complete generality, for any CM sextic field K, and computes minimal polynomials of the Rosenhain invariants for any period matrix of the Jacobian. This algorithm can be used to generate genus 3 hyperelliptic curves over a finite field Fp with a given zeta function by finding roots of the Rosenhain minimal polynomials modulo p.
منابع مشابه
Non-hyperelliptic modular Jacobians of dimension 3
We present a method to solve in an efficient way the problem of constructing the curves given by Torelli’s theorem in dimension 3 over the complex numbers: For an absolutely simple principally polarized abelian threefold A over C given by its period matrix Ω, compute a model of the curve of genus three (unique up to isomorphism) whose Jacobian, equipped with its canonical polarization, is isomo...
متن کاملIsogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves
We describe the use of explicit isogenies to reduce Discrete Logarithm Problems (DLPs) on Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, which are vulnerable to faster index calculus attacks. We provide algorithms which compute an isogeny with kernel isomorphic to (Z/2Z) for any hyperelliptic genus 3 curve. These algorithms provide a rational isogeny...
متن کاملThe average size of the 2-Selmer group of Jacobians of hyperelliptic curves having a rational Weierstrass point
We prove that when all hyperelliptic curves of genus n ≥ 1 having a rational Weierstrass point are ordered by height, the average size of the 2-Selmer group of their Jacobians is equal to 3. It follows that (the limsup of) the average rank of the Mordell-Weil group of their Jacobians is at most 3/2. The method of Chabauty can then be used to obtain an effective bound on the number of rational p...
متن کاملDecomposing Jacobians of Hyperelliptic Curves
Many interesting questions can be asked about the decomposition of Jacobians of curves. For instance, we may want to know which curves have completely decomposable Jacobians (Jacobians which are the product of g elliptic curves) [4]. We may ask about number theoretic properties of the elliptic curves that show up in the decomposition of Jacobians of curves [2]. We would also like to know how ma...
متن کاملConstructing pairing-friendly hyperelliptic curves using Weil restriction
A pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding degree with respect to a large prime-order subgroup. In this paper we construct pairing-friendly genus 2 curves over finite fields Fq whose Jacobians are ordinary and simple, but not absolutely simple. We show that constructing such curves is equivalent to constructing elliptic curves over Fq that become ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016